翻訳と辞書 Words near each other ・ Proof (truth) ・ Proof and Experimental Establishment ・ Proof and Experimental Test Establishment ・ Proof assistant ・ Proof Banknote ・ Proof by assertion ・ Proof by contradiction ・ Proof by contrapositive ・ Proof by example ・ Proof by exhaustion ・ Proof by infinite descent ・ Proof by intimidation ・ Proof calculus ・ Proof coinage ・ Proof complexity ・ Proof compression ・ Proof discography ・ Proof game ・ Proof mass ・ Proof mining ・ Proof net ・ Proof of age inquisition ・ Proof of Age Standards Scheme ・ Proof of Bertrand's postulate ・ Proof of Citizenship of the Republic of Indonesia ・ Proof of concept ・ Proof of delivery ・ Proof of Destruction ・ Proof of Existence ・ Proof of Fermat's Last Theorem Dictionary Lists mini英和辞書 mini和英辞書 Webster 1913 Latin-English FOLDOC Wikipedia English ウィキペディア

翻訳と辞書　辞書検索 [ 開発暫定版 ] スポンサード リンク Proof compression ： ウィキペディア英語版 Proof compression In proof theory, an area of mathematical logic, proof compression is the problem of algorithmically compressing formal proofs. The developed algorithms can be used to improve the proofs generated by automated theorem proving tools such as sat-solvers, SMT-solvers, first-order theorem provers and proof assistants. ==Problem Representation== In propositional logic a resolution proof of a clause $\backslash kappa$ from a set of clauses C is a directed acyclic graph (DAG): the input nodes are axiom inferences (without premises) whose conclusions are elements of C, the resolvent nodes are resolution inferences, and the proof has a node with conclusion $\backslash kappa$.〔Fontaine, Pascal; Merz, Stephan; Woltzenlogel Paleo, Bruno. ''Compression of Propositional Resolution Proofs via Partial Regularization''. 23rd International Conference on Automated Deduction, 2011.〕 The DAG contains an edge from a node $\backslash eta\_$ to a node $\backslash eta\_$ if and only if a premise of $\backslash eta\_$ is the conclusion of $\backslash eta\_$. In this case, $\backslash eta\_$ is a child of $\backslash eta\_$, and $\backslash eta\_$ is a parent of $\backslash eta\_$. A node with no children is a root. A proof compression algorithm will try to create a new DAG with fewer nodes that represents a valid proof of $\backslash kappa$ or, in some cases, a valid proof of a subset of $\backslash kappa$. 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Proof compression」の詳細全文を読む スポンサード リンク 翻訳と辞書 : 翻訳のためのインターネットリソース Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.